Pfaffian Presentations of Elliptic Normal Curves
نویسنده
چکیده
We investigate certain alternating matrices of linear forms whose Pfaffians generate the homogeneous ideal of an elliptic normal curve, or one of its higher secant varieties.
منابع مشابه
An elliptic generalization of Schur’s Pfaffian identity
We present a Pfaffian identity involving elliptic functions, whose rational limit gives a generalization of Schur’s Pfaffian identity for Pf((xj −xi)/(xj +xi)). This identity is regarded as a Pfaffian counterpart of Frobenius identity, which is an elliptic generalization of Cauchy’s determinant identity for det(1/(xi + xj)).
متن کاملZeta functions of nilpotent groups - singular Pfaffians
The local normal zeta functions of a finitely generated, torsion-free nilpotent group G of class 2 depend on the geometry of the Pfaffian hypersurface associated to the bilinear form induced by taking commutators in G. The smallest examples of zeta functions which are not finitely uniform arise from groups whose associated Pfaffian hypersurfaces are plane curves. In this paper we study groups w...
متن کاملComplete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کامل